A New Smoothing Conjugate Gradient Method for Solving Nonlinear Nonsmooth Complementarity Problems
نویسندگان
چکیده
منابع مشابه
A New Smoothing Conjugate Gradient Method for Solving Nonlinear Nonsmooth Complementarity Problems
In this paper, by using the smoothing Fischer-Burmeister function, we present a new smoothing conjugate gradient method for solving the nonlinear nonsmooth complementarity problems. The line search which we used guarantees the descent of the method. Under suitable conditions, the new smoothing conjugate gradient method is proved globally convergent. Finally, preliminary numerical experiments sh...
متن کاملA New Smoothing Nonlinear Conjugate Gradient Method for Nonsmooth Equations with Finitely Many Maximum Functions
and Applied Analysis 3 By Lemmas 4 and 5, we have Lemma 6. Lemma 6. Suppose that Assumption 3 holds, αk is determined by (9), and we get
متن کاملSmoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
Image restoration problems are often converted into large-scale, nonsmooth and nonconvex optimization problems. Most existing minimization methods are not efficient for solving such problems. It is well-known that nonlinear conjugate gradient methods are preferred to solve large-scale smooth optimization problems due to their simplicity, low storage, practical computation efficiency and nice co...
متن کاملA New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملA Regularization Newton Method for Solving Nonlinear Complementarity Problems
In this paper we construct a regularization Newton method for solving the nonlinear complementarity problem (NCP(F)) and analyze its convergence properties under the assumption that F is a P0-function. We prove that every accumulation point of the sequence of iterates is a solution of NCP(F) and that the sequence of iterates is bounded if the solution set of NCP(F) is nonempty and bounded. More...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2015
ISSN: 1999-4893
DOI: 10.3390/a8041195